Англо-русский словарь по социологии. 2011.
Problem of induction — The problem of induction is the philosophical question of whether inductive reasoning is valid. That is, what is the justification for either:# generalizing about the properties of a class of objects based on some number of observations of… … Wikipedia
question — ques|tion1 W1S1 [ˈkwestʃən] n ▬▬▬▬▬▬▬ 1¦(asking for information)¦ 2¦(subject/problem)¦ 3¦(doubt)¦ 4 without question 5 there is no question of something happening/somebody doing something 6 in question 7 be a question of something 8 it s… … Dictionary of contemporary English
Question — For other uses, see Question (disambiguation). For questions about Wikipedia, see Wikipedia:Questions. “ There are these four ways of answering questions. Which four? There are questions that should be answered categorically [straightforwardly… … Wikipedia
question — 1 / kwestSFn/ noun (C) 1 ASKING FOR INFORMATION a sentence or phrase that asks for information: ask (sb) a question: They asked me a lot of questions about my work experience. | May I ask a question? | answer a question: Answer three out of five… … Longman dictionary of contemporary English
important — adj. VERBS ▪ be, seem, sound ▪ Someone left a message for you it sounded important. ▪ become ▪ remain ▪ … Collocations dictionary
P = NP problem — The relationship between the complexity classes P and NP is an unsolved question in theoretical computer science. It is considered to be the most important problem in the field – the Clay Mathematics Institute has offered a $1 million US prize… … Wikipedia
Problem of evil — Part of a series on God General conceptions … Wikipedia
problem — {{Roman}}I.{{/Roman}} noun 1 sth that causes difficulties ADJECTIVE ▪ acute, big, enormous, grave, great, huge, important, major, serious, significant … Collocations dictionary
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Chess problem — Part of a series on Puzzles … Wikipedia
Boolean satisfiability problem — For the concept in mathematical logic, see Satisfiability. 3SAT redirects here. For the Central European television network, see 3sat. In computer science, satisfiability (often written in all capitals or abbreviated SAT) is the problem of… … Wikipedia
